Cranking: Combining Rankings Using Conditional Probability Models on Permutations

نویسندگان

  • Guy Lebanon
  • John D. Lafferty
چکیده

A new approach to ensemble learning is introduced that takes ranking rather than classification as fundamental, leading to models on the symmetric group and its cosets. The approach uses a generalization of the Mallows model on permutations to combine multiple input rankings. Applications include the task of combining the output of multiple search engines and multiclass or multilabel classification, where a set of input classifiers is viewed as generating a ranking of class labels. Experiments for both types of applications are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mallows and Generalized Mallows Model for Matchings

The Mallows and Generalized Mallows Models are two of the most popular probability models for distributions on permutations. In this paper we consider both models under the Hamming distance. This models can be seen as models for matchings instead of models for rankings. These models can not be factorized, which contrasts with the popular MM and GMM under Kendall’s-τ and Cayley distances. In ord...

متن کامل

Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic

We study the problem of learning probabilistic models for permutations, where the order between highly ranked items in the observed permutations is more reliable (i.e., consistent in different rankings) than the order between lower ranked items, a typical phenomena observed in many applications such as web search results and product ranking. We introduce and study a variant of the Mallows model...

متن کامل

Tractable Search for Learning Exponential Models of Rankings

We consider the problem of learning the Generalized Mallows (GM) model of [Fligner and Verducci, 1986], which represents a probability distribution over all possible permutations (or rankings) of a given set of objects. The training data consists of a set of permutations. This problem generalizes the well known rank aggregation problem. Maximum Likelihood estimation of the GM model is NP-hard. ...

متن کامل

Gender and the Factors Affecting Child Labor in Iran: an Application of IV-TOBIT Model

In this paper we first intend to examine the probability of falling into the realm of child labor by using conditional probability theorem. Furthermore, we will compare the extent of each factor’s effect on boys and girls using a TOBIT regression model. Finally we will analyze aspects of Iran’s labor market to assess the future ahead of the children who work at present. As the results will show...

متن کامل

Uncovering the Riffled Independence Structure of Rankings

Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of n objects scales factorially in n. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impose strong sparsity constraints on distributions and are unsuitable for modeling r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002